Crowdsourcing Theorem Proving via Natural Games
نویسندگان
چکیده
Despite the science of modern formal reasoning being more than a century old, mechanized formal reasoning is nowhere near what expert human reasoners (formal and informal) can achieve. Meanwhile, there is a steadily increasing need for automated theorem proving in various fields of science and engineering. Proof discovery and verification in science and mathematics [2,3,4,5], formal verification for hardware and software [6,7] and logic-based AI [8,9,10] are all based on formal theorem proving. We present initial results from a project on augmenting automated theorem provers with crowdsourced theorem proving through games. The project was started based on the following two seemingly unrelated observations:
منابع مشابه
A short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملCurating an Open Information Extraction Knowledge Base Using Games with a Purpose
We are interested in measuring how games with a purpose can be used as a crowdsourcing solution for transforming a (huge) set of triples extracted from Wikipedia into a useful knowledge base. We describe the natural language processing pipeline used for generating questions that we turned into games. We present three games we implemented.
متن کاملPut My Galakmid Coin into the Dispenser and Kick It: Computational Linguistics and Theorem Proving in a Computer Game
We combine state-of-the-art techniques from computational linguistics and theorem proving to build an engine for playing text adventures, computer games with which the player interacts purely through natural language. The system employs a parser for dependency grammar and a generation system based on TAG, and has components for resolving and generating referring expressions. Most of these modul...
متن کاملA New Common Fixed Point Theorem for Suzuki Type Contractions via Generalized $Psi$-simulation Functions
In this paper, a new stratification of mappings, which is called $Psi$-simulation functions, is introduced to enhance the study of the Suzuki type weak-contractions. Some well-known results in weak-contractions fixed point theory are generalized by our researches. The methods have been appeared in proving the main results are new and different from the usual methods. Some suitable examples ar...
متن کاملWorkshops Held at the First AAAI Conference on Human Computation and Crowdsourcing: A Report
Crowdsourcing (HCOMP-2013) was held November 6– 9, 2013, in Palm Springs, California. Three workshops took place on Saturday, November 9: Crowdsourcing at Scale, Disco: Human and Machine Learning in Games, and Scaling Speech, Language Understanding, and Dialogue through Crowdsourcing. The goal of the Crowdsourcing at Scale workshop was to identify the biggest challenges in very large-scale crow...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016